An Extremal Problem in Uniform Distribution Theory
نویسندگان
چکیده
منابع مشابه
An Extremal Problem in Generalized Ramsey Theory
A connected graph G of order n is called m-good if r(Km ,G) = (m-1)(n-1) + 1 . Let f(m,n) be the largest integer q such that every connected graph of order n and size q is m-good and let g(m,n) be the largest q for which there exists a connected graph G of order n and size q which is m-good . Asymptotic bounds are given for f and g . 1 . Tntroduction . One of the most notable yet simply proved ...
متن کاملAn Extremal Problem in Interpolation Theory
If z1, z2, . . . , zn are complex numbers in the open unit disk D and A1, A2, . . . , An are N ×N matrices, let F denote the family of analytic functions, bounded in D, such that for each F ∈ F , F (zk) = Ak, k = 1, 2, . . . , n. We consider ρ = infF∈F supz∈D |F (z)|sp where | · |sp denotes the spectral radius. H. Bercovici has raised the question whether this infimum is attained. We will show ...
متن کاملAn Extremal Problem in Graph Theory
G(?z; I) will denote a graph of n vertices and 1 edges. Let fO(lz, K) be the smallest integer such that there is a G (n; f,, (n, k)) in which for every set of K vertices there is a vertex joined to each of these. Thus for example fO(3, 2) = 3 since in a triangle each pair of vertices is joined to a third. It can readily be checked that f,(4, 2) = 5 (the extremal graph consists of a complete 4-g...
متن کاملOn a problem in extremal graph theory
The number T*(n, k) is the least positive integer such that every graph with n = (*:I) + t vertices (t > 0) and at least T*(n, k) edges contains k mutually vertex-disjoint complete subgraphs S, , S, ,..., Sk where S, has ivertices, I < i Q k. Obviously T*(n, k) > T(n, k), the Turan number of edges for a Ki . It is shown that if n > gkk” then equality holds and that there is c :0 such that for (...
متن کاملAn Extremal Problem for Sets with Applications to Graph Theory
We prove that h<J-J:_, 1 " ;' a). This result is best possible and has some interesting consequences. Its proof uses multilinear techniques (exterior algebra).
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Uniform distribution theory
سال: 2016
ISSN: 2309-5377
DOI: 10.1515/udt-2016-0012